https://nova.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:35341 Wed 17 Jul 2019 10:00:25 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:34181 Tue 19 Feb 2019 11:27:14 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11534 Tue 16 Oct 2018 12:43:30 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:35283 Tue 09 Jul 2019 12:21:18 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:1934 Sat 24 Mar 2018 08:33:19 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:17702 Sat 24 Mar 2018 07:57:31 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:28508 ∞ norm computation in discrete time is analyzed. Rapid sampling scenarios are examined comparing both shift and delta operator formulations of the equations. The shift operator formulation is shown in general to be arbitrarily poorly conditioned as the sampling rate increases. The delta operator formulation includes both recentering (to avoid cancellation problems) and rescaling, and avoids these difficulties. However, it is also shown that rescaling of the shift operator formulation gives substantial improvements in numerical conditioning, whilst recentering is of more limited benefit.]]> Sat 24 Mar 2018 07:29:21 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:24052 d, where d is a random variable that follows a predefined degree distribution Ω(x). Then, users transmit in d sub-channels chosen uniformly at random. Specifically, we consider signal to interference and noise ratio (SINR) based RMAC where it is assumed that a user's information can be recovered successfully at a given iteration of the SIC process when its updated SINR is above a predetermined threshold. In this paper, we develop a generalized analytical framework based on the codes-on-graph representation to track the evolution of error probabilities in each iteration of the SIC process. We compare our approach to the conventional RMAC employing SIC which assumes that only clean, interference-free transmissions can be recovered successfully. This clean packet model relies on having time slots with a single user's transmission at each iteration of the SIC process. It was shown to be analogous to the iterative recovery process of codes-on-graph for the binary erasure channel (BEC), thus, allowing the direct application of the AND-OR tree analysis. We show that the clean packet model is a special case of our more generalized tree-based analytical framework. Our numerical results show that our model can support more users under the same power requirements.]]> Sat 24 Mar 2018 07:09:43 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:40746 Mon 18 Jul 2022 13:26:25 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:40670 Mon 18 Jul 2022 08:32:25 AEST ]]>